Parallel Construction of Quadtrees and Quality Triangulations
نویسندگان
چکیده
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(logn) for point set input and O(logn log k) time for planar straight-line graphs, using O(n+k/ logn) processors, where n measures input size and k output size.
منابع مشابه
Parallel Processing of Pointer Based Quadtrees on Hypercube Multiprocessors
This paper studies the parallel construction and manipulation of pointer based quadtrees on the hypercube multiprocessor. While parallel algorithms for the manipulation of a variant of linear quadtrees have been previously studied in the literature, no parallel pointer based quadtree construction algorithms have been presented. In this paper, we solve the problem of efficiently constructing poi...
متن کاملTriangulating the Square and Squaring the Triangle : 1 Quadtrees and Delaunay Triangulations are Equivalent
4 We show that Delaunay triangulations and compressed quadtrees are equivalent structures. More precisely, 5 we give two algorithms: the first computes a compressed quadtree for a planar point set, given the Delaunay 6 triangulation; the second finds the Delaunay triangulation, given a compressed quadtree. Both algorithms 7 run in deterministic linear time on a pointer machine. Our work builds ...
متن کاملChapter 2 Quadtrees - Hierarchical Grids
x What do you know? You know just what you perceive. What can you show? Nothin' of what you believe, And as you grow, each thread of life that you leave Will spin around your deeds and dictate your needs As you sell your soul and you sow your seeds, And you wound yourself and your loved one bleeds, And your habits grow, and your conscience feeds On all that you thought you should be – I never t...
متن کاملAutomatic construction of quality nonobtuse boundary Delaunay triangulations
In this paper we discuss the automatic construction of quality nonobtuse boundary Delaunay triangulations of polygons such as needed for control volume or nite element method applications. These are Delaunay triangulations whose smallest angles are bounded and, in addition, whose boundary triangles do not have obtuse angles opposite to any boundary or interface edge. The method we propose in th...
متن کاملBisection-Based Triangulations of Nested Hypercubic Meshes
Hierarchical spatial decompositions play a fundamental role in many disparate areas of scientific and mathematical computing since they enable adaptive sampling of large problem domains. Although the use of quadtrees, octrees, and their higher dimensional analogues is ubiquitous, these structures generate meshes with cracks, which can lead to discontinuities in functions defined on their domain...
متن کامل